Spatial Query Optimization Based on Transformation of Constraints
نویسندگان
چکیده
This article describes a problem of spatial query optimization. The processing of such queries is a new area of rapidly developing domain of spatial databases. The main scope of considerations is the impact of constraints type on the speed of execution. Transformation of logical formulas is proposed for some kind of queries as a method of optimization. Proposed decompositions of queries were done according to the logic and set theory. It is experimentally proved that the presented way of optimization is efficient.
منابع مشابه
Learning Transformation Rules for Semantic Query Optimization: A Data-Driven Approach
Learning query transformation rules is vital for the success of semantic query optimization in domains where the user cannot provide a comprehensive set of integrity constraints. Finding these rules is a discovery task because of the lack of target. Previous approaches to learning query transformation rules have been based on analyzing past queries. We propose a new approach to learning query t...
متن کاملDeveloping a BIM-based Spatial Ontology for Semantic Querying of 3D Property Information
With the growing dominance of complex and multi-level urban structures, current cadastral systems, which are often developed based on 2D representations, are not capable of providing unambiguous spatial information about urban properties. Therefore, the concept of 3D cadastre is proposed to support 3D digital representation of land and properties and facilitate the communication of legal owners...
متن کاملSubsumption for Semantic Query Optimization in OODB
The purpose of semantic query optimization is to use semantic knowledge (e.g. integrity constraints) for transforming a query into an equivalent one that may be answered more eeciently than the original version. This paper proposes a general method for semantic query optimization in the framework of OODBs (Object Oriented Database Systems). The method is applicable to the class of conjunctive q...
متن کاملTSC-IRNN: Time- and Space-Constraint In-Route Nearest Neighbor Query Processing Algorithms in Spatial Network Databases
Although a large number of query processing algorithms in spatial network database (SNDB) have been studied, there exists little research on route-based queries. Since moving objects move only in spatial networks, route-based queries, like in-route nearest neighbor (IRNN), are essential for Location-based Service (LBS) and Telematics applications. However, the existing IRNN query processing alg...
متن کاملConstraint-Based Query Optimization and Processing
Constraint technology can be used to extend the functionality and performance of current database systems in a variety of ways. In this paper, we show how to use constraints for the processing of queries that contain user-deened functions. Such functions are a common feature in many extended and object-oriented database applications. By representing knowledge about the functions through constra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013